Welcome![Sign In][Sign Up]
Location:
Search - finite state automaton

Search list

[Other resourceair_conditioner

Description: 空调温控电路有限状态自动机, 有TEMP_HIGH和TEMP_LOW 分别与传感器相连用语检测室内温度.-air-conditioning temperature control circuit finite state automaton, and TEMP_LOW TEMP_HIGH with sensors connected to the indoor temperature detection terminology.
Platform: | Size: 3200 | Author: | Hits:

[JSP/Javajava-fsm-devel-alpha-0.1.tar

Description: JAVA实现的有限状态自动机。该软件适合Linux环境下安装运行。-JAVA the finite-state automaton. The software is suitable for the installation of the Linux operating environment.
Platform: | Size: 15231 | Author: 马艳军 | Hits:

[VHDL-FPGA-Verilogair_conditioner

Description: air-conditioning temperature control circuit finite state automaton
Platform: | Size: 1758 | Author: besoyal@yahoo.gr | Hits:

[JSP/Javajava-fsm-devel-alpha-0.1.tar

Description: JAVA实现的有限状态自动机。该软件适合Linux环境下安装运行。-JAVA the finite-state automaton. The software is suitable for the installation of the Linux operating environment.
Platform: | Size: 15360 | Author: 马艳军 | Hits:

[VHDL-FPGA-Verilogair_conditioner

Description: 空调温控电路有限状态自动机, 有TEMP_HIGH和TEMP_LOW 分别与传感器相连用语检测室内温度.-air-conditioning temperature control circuit finite state automaton, and TEMP_LOW TEMP_HIGH with sensors connected to the indoor temperature detection terminology.
Platform: | Size: 3072 | Author: | Hits:

[Windows Develop1

Description: 把非确定有穷状态自动机NFA转换为确定有穷状态自动机DFA!-The non-deterministic finite state automaton NFA is converted to determine the finite state automaton DFA!
Platform: | Size: 1024 | Author: 王博 | Hits:

[Software EngineeringNFA

Description: 在非确定的有限自动机NFA中,由于某些状态的转移需从若干个可能的后续状态中进行选择,故一个NFA对符号串的识别就必然是一个试探的过程。这种不确定性给识别过程带来的反复,无疑会影响到FA的工作效率,所以我们有必要将NFA确定化。-In the non-deterministic finite automaton of the NFA, because of the transfer of certain state to be from a number of possible follow-up to the state to choose, so a NFA identification string of symbols must be on a trial process. This uncertainty to the recognition process brought about by repeated, it will undoubtedly affect the efficiency of the FA, so we need to determine of NFA.
Platform: | Size: 79872 | Author: 陈成 | Hits:

[Mathimatics-Numerical algorithmsAutoMachine_v1p0

Description: 为人工情感的有限自动机模型,传入函数的参数包括:此刻的情绪状态向量,此刻的输入向量;函数输出为下一时刻的情绪状态向量和行为输出向量。-For the artificial emotion finite automaton model, the parameters passed to the function include: the emotional state vector at the moment, at the moment the input vector function of the output for the next moment of emotional and behavioral state vector output vectors.
Platform: | Size: 1024 | Author: 王巍 | Hits:

[Windows DevelopRunFA

Description: 构造相应文法的有穷状态自动机自动机,运行此自动机,识别一个字符串是否是该文法的句子-Construct a corresponding grammar finite state machine automaton, run this automaton to identify whether a string is the grammar of the sentence
Platform: | Size: 2048 | Author: 陌生初熏 | Hits:

[VC/MFCdfa

Description: 设有如下确定的状态转换图,0为起始状态,3,4为终结状态。编写程序,判断用户输入的符号串,是否被该有限自动机接受。-Are identified with the state transition diagram for the initial state 0, 3,4 for the end of the state. Write a program to determine the user input string of symbols, whether by the finite automaton to accept.
Platform: | Size: 1024 | Author: fuyuqi | Hits:

[ELanguageDFA

Description: Compiler tech:Program For Acceptance Of A String Using deterministic finite automaton (DFA) which is a finite state machine accepting finite strings of symbols. For each state, there is a transition arrow leading out to a next state for each symbol. Upon reading a symbol, a DFA jumps deterministically from a state to another by following the transition arrow
Platform: | Size: 1024 | Author: jack | Hits:

[Other(HIT)Lexical-analysis

Description: 词法分析 词法分析器(Scanner)的功能 正规表达式 状态转换图 词法分析器的设计与实现 有穷自动机FA -Design and Implementation of regular expressions state transition diagram of lexical analyzer lexical analysis lexical analyzer (Scanner) function finite automaton FA
Platform: | Size: 360448 | Author: fluck | Hits:

[CSharpexe3

Description: 使用c语言编写的一个接受“实常数”语言的有穷状态自动机-Using c language one to accept the " real constant" languages ​ ​ finite state automaton
Platform: | Size: 1024 | Author: 雨晴 | Hits:

[ELanguageNFA_TO_DFA

Description: 不确定有限状态自动机的确定化(NFA_TO_DFA) 编译原理实验-Uncertain finite state automaton and the determination of (NFA_TO_DFA) Compiler Principle Experiment
Platform: | Size: 5120 | Author: guochenggai | Hits:

[simulation modeling元胞自动机与Matlab

Description: 元胞自动机(CA)是一种用来仿真局部规则和局部联系的方法。典型的元胞自动机是定义在网格上的,每一个点上的网格代表一个元胞与一种有限的状态。变化规则适用于每一个元胞并且同时进行。典型的变化规则,决定于元胞的状态,以及其( 4或8 )邻居的状态。元胞自动机已被应用于物理模拟,生物模拟等领域。本文就一些有趣的规则,考虑如何编写有效的MATLAB的程序来实现这些元胞自动机。(Cellular automata (CA) is a method for simulating local rules and local relations. A typical cellular automaton is defined on a grid, where the mesh on each point represents a cell and a finite state. The change rules apply to each cell and simultaneously. A typical change rule is determined by the state of the cell and the state of its (4 or 8) neighbors. Cellular automata have been applied to many fields such as physical simulation and biological simulation. This article deals with some interesting rules that consider how to write effective MATLAB programs to implement these cellular automata.)
Platform: | Size: 231424 | Author: c.ljx | Hits:

CodeBus www.codebus.net